Entropy-based pattern matching for document image compression
نویسندگان
چکیده
In this paper, we introduce a pattern matching algorithm used in document image compression. This pattern matching algorithm uses the cross entropy between two patterns as the criterion for a match. We use a physical model which is based on the nite resolution of the scanner (spatial sampling error) to estimate the probability values used in cross entropy calculation. Experimental results show this pattern matching algorithm compares favorably to previous algorithms.
منابع مشابه
Bitmap reconstruction for document image compression
We introduce a pattern matching algorithm and a bitmap reconstruction method used in document image compression. This pattern matching algorithm uses the cross entropy between two patterns as the criterion for a match. We use a physical model which is based on the nite resolution of the scanner (spatial sampling error) to estimate the probability values used in cross entropy calculation. The ma...
متن کاملA Codebook Generation Algorithm for Document Image Compression
Pattern-matching based document compression systems rely on finding a small set of patterns that can be used to represent all of the ink in the document. Finding an optimal set of patterns is NP-hard; previous compression schemes have resorted to heuristics. We extend the cross-entropy approach, used previously for measuring pattern similarity, to this problem. Using this approach we reduce the...
متن کاملPattern Matching Image Compression: Algorithmic and Empirical Results
ÐWe propose a nontransform image compression scheme based on approximate one-dimensional pattern matching that we name Pattern Matching Image Compression (PMIC). The main idea behind it is a lossy extension of the Lempel-Ziv data compression scheme in which one searches for the longest prefix of an uncompressed image that approximately occurs in the already processed image (e.g., in the sense o...
متن کاملPattern Matching Image Compression with Predication Loop: Preliminary Experimental Results
Recently, a novel image compression technique based on pattern matching was proposed, namely Pattern Matching Image Compression (PMIC). Basically, it is a lossy extension of the well known Lempel-Ziv scheme. It was proved that such an extension leads to a suboptimal compression, and that the compression ratio can as low as the so called R enyi entropy. Success of PMIC crucially depends on sever...
متن کاملPatternmatching Image Compressionwith Predication
Recently, a novel image compression technique based on pattern matching was proposed, namely Pattern Matching Image Compression (PMIC). Basically, it is a lossy extension of the well known Lempel-Ziv scheme. It was proved that such an extension leads to a suboptimal compression, and that the compression ratio can as low as the so called R enyi entropy. Success of PMIC crucially depends on sever...
متن کامل